package com.zhiwen.test;

/**
 * @Auther: wuzhiwen
 * @Date: 2018/11/13 14:01
 * @Description:
 */
public class ErFenSortDemo {

    public static void main(String[] args) {

//        int k = 0;
//        System.out.println(k--);
//        System.out.println(k);

//        int[] data = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
//        int key = 8;
//
//        int hight = data.length - 1;
//        int low = 0;
//        while (low <= hight) {
//            int mid = (hight + low) / 2;
//            if (data[mid] > key)
//                low = mid++;
//            else if (data[mid] < key)
//                hight = mid--;
//            else break;
//        }
//        System.out.println((hight + low) / 2);

//        int[] data = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
//        int key = 8;

//        int hight = data.length - 1;
//        int low = 0;
//        while (low <= hight) {
//            int mid = (hight + low) / 2;
//            if (data[mid] < key)
//                low = ++mid;
//            else if (data[mid] > key)
//                hight = --mid;
//            else break;
//        }
//        System.out.println((hight + low) / 2+1);
        int o = 16*16*16*16*16*16*16*8-1;
        System.out.println(o);

    }

}
